The Role of Monotonicity in the Epistemic Analysis of Strategic Games

It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski's Fixpoint Theorem.Comment: 20 page

Urbanization and the aged

Changing family studie

Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. Rationality here means playing only strategies one believes to be best responses. This involves looking at two formal languages. One is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best response. The other is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.Comment: 16 pages, Proc. 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XI). To appea

Hubungan Tingkat Pengetahuan Dengan Ketepatan Pemilihan Obat Influenza Pada Mahasiswa Farmasi UMS

Influenza merupakan self limiting disease yang dapat menyerang setiap orang tanpa mengenal usia dan jenis kelamin. Salah satu upaya pengobatan yang paling sering dilakukan untuk mengobati penyakit ini adalah dengan tindakan swamedikasi. Pengetahuan yang baik sangat diperlukan agar tindakan swamedikasi berjalan baik sehingga tecapai tujuan pengobatan yang diinginkan. Tujuan penelitian ini untuk mengetahui hubungan antara tingkat pengetahuan dengan ketepatan pemilihan obat influenza pada mahasiswa Farmasi UMS. Penelitian dilakukan dengan metode cross sectional menggunakan kuesioner terhadap 100 mahasiswa Farmasi yang pernah atau sedang melakukan swamedikasi influenza. Teknik pengambilan sampel menggunakan purposive quota sampling. Analisis data secara deskriptif dilakukan dengan uji chi square. Hasil penelitian katagori baik sekali untuk pengetahuan sebesar 46%, dan baik sebesar 33%. Hasil ketepatan pemilihan obat 76% belum tepat berdasarkan kerasionalannya. Hasil pengujian chi square menunjukkan bahwa tidak ada hubungan antara tingkat pengetahuan mahasiswa Farmasi Universitas Muhammadiyah Surakarta terhadap ketepatan pemilihan obat influenza dengan nilai p = 0,109

Arithmetic Classification of Perfect Models of Stratified Programs (Addendum)

RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of perfect models and has been inadvertently omitted in the previous version of the paper. We say that a general program P is recursion-free if in its dependency graph Dp there is no cycle. Clearly recursion-free programs form a subclass of stratified programs. Recursion-free programs form a very simple generalization of the class of hierarchical programs introduced in [C78]. Hierarchical programs satisfy an additional condition on variable occurrences in clauses that prevents floundering, i.e. a forced selection of a non-ground negative literal in an SLDNF- derivation. In this section we study the complexity of perfect models of recursion-free programs

Fair termination revisited - with delay

AbstractA proof method for establishing the fair termination and total correctness of both nondeterministic and concurrent programs is presented. The method calls for the extension of state by auxiliary delay variables which count down to the instant in which certain action will be scheduled. It then uses well-founded ranking to prove fair termination allowing nested fair selection and loops